Discrimination by Parallel Observers: The Algorithm

Discrimination by Parallel Observers

Adaptive Line Enhancement Using a Parallel IIR Filter with A Step-By-step Algorithm

 A step-by-step algorithm for enhancement of periodic signals that are highly corrupted by additive uncorrelated white gausian noise is proposed. In each adaptation step a new parallel second-order section is added to the previous filters. Every section has only one adjustable parameter, i.e., the center frequency of the self-tuning filter. The bandwidth and the convergence factor of each secti...

Discrimination contours for the perception of head-centered velocity.

There is little direct psychophysical evidence that the visual system contains mechanisms tuned to head-centered velocity when observers make a smooth pursuit eye movement. Much of the evidence is implicit, relying on measurements of bias (e.g., matching and nulling). We therefore measured discrimination contours in a space dimensioned by pursuit target motion and relative motion between target...

Discrimination of planar surface slant from texture: human and ideal observers compared

In order to quantify the ability of the human visual system to use texture information to perceive planar surface orientation, I measured subjects' ability to discriminate planar surface slant (angle away from the fronto-parallel) for a variety of different types of textures and in a number of different viewing conditions. I measured the subjects' discrimination performance as a function of sur...

Parallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm

This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...

Parallel Generation of t-ary Trees

A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...